Algorithms for Efficient Computation of Convolution
نویسندگان
چکیده
Convolution is an important mathematical tool in both fields of signal and image processing. It is employed in filtering [1, 2], denoising [3], edge detection [4, 5], correlation [6], compression [7, 8], deconvolution [9, 10], simulation [11, 12], and in many other applications. Although the concept of convolution is not new, the efficient computation of convolution is still an open topic. As the amount of processed data is constantly increasing, there is considerable request for fast manipulation with huge data. Moreover, there is demand for fast algorithms which can exploit computational power of modern parallel architectures.
منابع مشابه
درکنش سد و مخزن در دامنه زمان به وسیله روش انتگرال حلقوی منفرد مجزا (DSC)
In this paper, time-domain dynamic analysis of dam - infinite reservoir is studied. A numerical method, discrete singular convolution (DSC), which seems to be efficient and simple, has been used to model the mixed boundary conditions. After a brief introduction, DSC is applied to model the equation of motion of fluid-structure with constant cross section subjected to El-Centro (1940) earthquake...
متن کاملA Package for Generating, Manipulating, and Testing Convolution Algorithms
This report describes a Maple package created for exploring the techniques of Winograd, Nussbaumer, and others for computing “fast” convolution algorithms. After codifying known convolution techniques into a common framework of bilinear algorithms built from parameterized matrices and algebraic operators, Maple’s symbolic and algebraic computation facilities are used to derive and manipulate th...
متن کاملEvaluating Performance of Algorithms in Lung IMRT: A Comparison of Monte Carlo, Pencil Beam, Superposition, Fast Superposition and Convolution Algorithms
Background: Inclusion of inhomogeneity corrections in intensity modulated small fields always makes conformal irradiation of lung tumor very complicated in accurate dose delivery.Objective: In the present study, the performance of five algorithms via Monte Carlo, Pencil Beam, Convolution, Fast Superposition and Superposition were evaluated in lung cancer Intensity Modulated Radiotherapy plannin...
متن کاملBilinear algorithms for discrete cosine transforms of prime lengths
Abstract: This paper presents a strategy to design bilinear discrete cosine transform (DCT) algorithms of prime lengths. We show that by using multiplicative groups of integers, one can identify and arrange the computation as a pair of convolutions. When the DCT length p is such that (p−1)/2 is odd, the computation uses two (p−1)/2 point cyclic convolutions. When (p − 1)/2 = 2q with m > 0 and q...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013